Computing the von Neumann-Morgenstern characteristic functionυ(S) for cooperativen-person transferable utility normal form games: LP and saddlepoint solutions
نویسندگان
چکیده
منابع مشابه
How to Compute Von Neumann-morgenstern Solutions
Cooperative games and von Neumann-Morgenstern solution. Situations when all participants collaborate with each other is known as a cooperative game. One way to describe a cooperative game is to assign, to every subset S ⊆ N def = {1, . . . , n} of the set of all the participants, the value v(S) that describes what players from S can gain if they collaborate between themselves only. Such subsets...
متن کاملVon Neumann–Morgenstern stable-set solutions in the assignment market
Existence of von Neumann–Morgenstern solutions (stable sets) is proved for any assignment game. For each optimal matching, a stable set is defined as the union of the core of the game and the core of the subgames that are compatible with this matching. All these stable sets exclude third-party payments and form a lattice with respect to the same partial order usually defined on the core.
متن کاملVon Neumann-Morgenstern solutions in the assignment market
The existence of von Neumann–Morgenstern solutions (stable sets) for assignment games has been an unsolved question since Shapley and Shubik [11]. For each optimal matching between buyers and sellers, Shubik [12] proposed considering the union of the core of the game and the core of the subgames that are compatible with this matching. We prove in the present paper that this set is the unique st...
متن کاملComputing Normal Form Perfect Equilibria for Extensive Two-person Games
This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector ...
متن کاملAggregating sets of von Neumann-Morgenstern utilities
We analyze the aggregation problem without the assumption that individuals and society have fully determined and observable preferences. More precisely, we endow individuals and society with sets of possible von Neumann-Morgenstern utility functions over lotteries. We generalize the classical neutrality assumption to this setting and characterize the class of neutral social welfare function. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 1988
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03202681